Closest-pair queries in fat rectangles
نویسندگان
چکیده
منابع مشابه
Closest pair queries in spatio-temporal databases
In recent years, spatio-temporal databases have been studied intensively. This paper proposes how to process k closest pair queries in spatio-temporal databases for the first time. A spatio-temporal k closest pair query continuously searches the k closest pairs between a set of spatial objects and a set of moving objects for a specified time interval of the query. To maintain the order of the k...
متن کاملClosest Pair Queries with Spatial Constraints
Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects. An extension to this problem is to generate the k closest pairs of objects (k-CPQ). In several cases spatial constraints are applied, and object pairs that are retrieved must also satisfy these constraints. Although the applicati...
متن کاملEnhancing SpatialHadoop with Closest Pair Queries
Given two datasets P and Q, the K Closest Pair Query (KCPQ) finds theK closest pairs of objects from P×Q. It is an operation widely adopted by many spatial and GIS applications. As a combination of the K Nearest Neighbor (KNN) and the spatial join queries, KCPQ is an expensive operation. Given the increasing volume of spatial data, it is difficult to perform a KCPQ on a centralized machine effi...
متن کاملAlgorithms for processing K-closest-pair queries in spatial databases
This paper addresses the problem of finding the K closest pairs between two spatial datasets (the so called, K Closest Pairs Query, K-CPQ), where each dataset is stored in an R-tree. There are two different techniques for solving this kind of distance-based query. The first technique is the incremental approach, which returns the output elements one-by-one in ascending order of distance. The se...
متن کاملTime-Windowed Closest Pair
Given a set of points in any constant dimension, each of which is associated with a time during which that point is active, we design a data structure with O(n log n) space that can find the closest pair of active points within a query interval of time in O(log log n) time using a quadtree-based approach in the word-RAM model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2019
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2019.05.003